Recovering Jointly Sparse Signals via Joint Basis Pursuit

نویسندگان

  • Samet Oymak
  • Babak Hassibi
چکیده

This work considers recovery of signals that are sparse over two bases. For instance, a signal might be sparse in both time and frequency, or a matrix can be low rank and sparse simultaneously. To facilitate recovery, we consider minimizing the sum of the l1-norms that correspond to each basis, which is a tractable convex approach. We find novel optimality conditions which indicates a gain over traditional approaches where l1 minimization is done over only one basis. Next, we analyze these optimality conditions for the particular case of time-frequency bases. Denoting sparsity in the first and second bases by k1, k2 respectively, we show that, for a general class of signals, using this approach, one requires as small as O(max{k1, k2} log log n) measurements for successful recovery hence overcoming the classical requirement of Θ(min{k1, k2} log( n min{k1,k2} )) for l1 minimization when k1 ≈ k2. Extensive simulations show that, our analysis is approximately tight.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Average Case Analysis of Multichannel Basis Pursuit

We consider the recovery of jointly sparse multichannel signals from incomplete measurements using convex relaxation methods. Worst case analysis is not able to provide insights into why joint sparse recovery is superior to applying standard sparse reconstruction methods to each channel individually. Therefore, we analyze an average case by imposing a probability model on the measured signals. ...

متن کامل

On the Support Recovery of Jointly Sparse Gaussian Sources using Sparse Bayesian Learning

Abstract—In this work, we provide non-asymptotic, probabilistic guarantees for successful sparse support recovery by the multiple sparse Bayesian learning (M-SBL) algorithm in the multiple measurement vector (MMV) framework. For joint sparse Gaussian sources, we show that M-SBL perfectly recovers their common nonzero support with arbitrarily high probability using only finitely many MMVs. In fa...

متن کامل

Using Joint Sparsity for Blind Separation of Noisy Multichannel Signals

We call a set of vectors z[k] ∈ R jointly sparse, when for the most of them all m components are simultaneously [close to] zero. When recovering this set from [indirect] noisy observations using variational approach, joint sparsity prior can be expressed via convex penalty term ∑ k ‖z[k]‖2. In this work we explore joint sparsity in the context of blind source separation problem X = AS + ξ, wher...

متن کامل

Sparse Optimization with Least - Squares Constraints Ewout

The use of convex optimization for the recovery of sparse signals from incomplete or compressed data is now common practice. Motivated by the success of basis pursuit in recovering sparse vectors, new formulations have been proposed that take advantage of different types of sparsity. In this paper we propose an efficient algorithm for solving a general class of sparsifying formulations. For sev...

متن کامل

Recovery of Block-Sparse Representations from Noisy Observations via Orthogonal Matching Pursuit

We study the problem of recovering the sparsity pattern of block-sparse signals from noise-corrupted measurements. A simple, efficient recovery method, namely, a block-version of the orthogonal matching pursuit (OMP) method, is considered in this paper and its behavior for recovering the block-sparsity pattern is analyzed. We provide sufficient conditions under which the block-version of the OM...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1202.3531  شماره 

صفحات  -

تاریخ انتشار 2012